The Transfer Principle holds for definable nonstandard models under Countable Choice
نویسندگان
چکیده
Łoś’s theorem for (bounded) D-ultrapowers, D being the ultrafilter introduced by Kanovei and Shelah [Journal of Symbolic Logic, 69(1):159–164, 2004], can be established within Zermelo–Fraenkel set theory plus Countable Choice (ZF+ACω). Thus, the Transfer Principle for both Kanovei and Shelah’s definable nonstandard model of the reals and Herzberg’s definable nonstandard enlargement of the superstructure over the reals [Mathematical Logic Quarterly, 54(2):167–175; 54(6):666– 667, 2008] can be shown in ZF+ACω. This establishes a conjecture by Mikhail Katz [personal communication].
منابع مشابه
Products of Lindelöf T2-spaces are Lindelöf — in some models of ZF
The stability of the Lindelöf property under the formation of products and of sums is investigated in ZF (= Zermelo-Fraenkel set theory without AC, the axiom of choice). It is • not surprising that countable summability of the Lindelöf property requires some weak choice principle, • highly surprising, however, that productivity of the Lindelöf property is guaranteed by a drastic failure of AC, ...
متن کاملTotally non-immune sets
Let L be a countable first-order language and M = (M, . . .) be an L-structure. “Definable set” means a subset of M which is L-definable in M with parameters. A set X ⊆ M is said to be immune if it is infinite and does not contain any infinite definable subset. X is said to be partially immune if for some definable A, A∩X is immune. X is said to be totally non-immune if for every definable A, A...
متن کاملOn Choice Principles and Fan Theorems
Veldman proved that the contrapositive of countable binary choice is a theorem of full-fledged intuitionism, to which end he used a principle of continuous choice and the fan theorem. It has turned out that continuous choice is unnecessary in this context, and that a weak form of the fan theorem suffices which holds in the presence of countable choice. In particular, the contrapositive of count...
متن کاملOrder-types of models of Peano arithmetic: a short survey
Here, PA is the first-order theory in the language with 0, 1,+, ·, < containing finitely many basic axioms true in N together with the first-order induction axiom scheme. Any model of PA has an initial segment isomorphic to N, and we will always identify N with this initial segment. The theory PA is well-known not to be complete, and has 2א0 complete extensions. ‘True arithmetic’—the theory Th(...
متن کاملOn countable choice and sequential spaces
Under the axiom of choice, every first countable space is a FréchetUrysohn space. Although, in its absence even R may fail to be a sequential space. Our goal in this paper is to discuss under which set-theoretic conditions some topological classes, such as the first countable spaces, the metric spaces or the subspaces of R, are classes of Fréchet-Urysohn or sequential spaces. In this context, i...
متن کامل